Graph Heterogeneous Multi-Relational Recommendation
نویسندگان
چکیده
Traditional studies on recommender systems usually leverage only one type of user behaviors (the optimization target, such as purchase), despite the fact that users also generate a large number various types interaction data (e.g., view, click, add-to-cart, etc). Generally, these heterogeneous multi-relational provide well-structured information and can be used for high-quality recommendation. Early efforts towards leveraging fail to capture high-hop structure user-item interactions, which are unable make full use them may achieve constrained recommendation performance. In this work, we propose new model named Graph Heterogeneous Collaborative Filtering (GHCF). To explore take advantages Convolutional Network (GCN) further improve it jointly embed both representations nodes (users items) relations prediction. Moreover, fully utilize whole data, perform advanced efficient non-sampling under multi-task learning framework. Experimental results two public benchmarks show GHCF significantly outperforms state-of-the-art methods, especially cold-start who have few primary item interactions. Further analysis verifies importance proposed embedding propagation modelling showing rationality effectiveness GHCF. Our implementation has been released (https://github.com/chenchongthu/GHCF).
منابع مشابه
Academic Paper Recommendation Based on Heterogeneous Graph
Digital libraries suffer from the overload problem, which makes the researchers have to spend much time to find relevant papers. Fortunately, recommender system can help to find some relevant papers for researchers automatically according to their browsed papers. Previous paper recommendation methods are either citation-based or contentbased. In this paper, we propose a novel recommendation met...
متن کاملCross-Graph Learning of Multi-Relational Associations
Cross-graph Relational Learning (CGRL) refers to the problem of predicting the strengths or labels of multi-relational tuples of heterogeneous object types, through the joint inference over multiple graphs which specify the internal connections among each type of objects. CGRL is an open challenge in machine learning due to the daunting number of all possible tuples to deal with when the number...
متن کاملA Framework for Community Detection in Heterogeneous Multi-Relational Networks
There has been a surge of interest in community detection in homogeneous single-relational networks which contain only one type of nodes and edges. However, many real-world systems are naturally described as heterogeneous multi-relational networks which contain multiple types of nodes and edges. In this paper, we propose a new method for detecting communities in such networks. Our method is bas...
متن کاملEdge Attention-based Multi-Relational Graph Convolutional Networks
Graph convolutional network (GCN) is generalization of convolutional neural network (CNN) to work with arbitrarily structured graphs. A binary adjacency matrix is commonly used in training a GCN. Recently, the attention mechanism allows the network to learn a dynamic and adaptive aggregation of the neighborhood. We propose a new GCN model on the graphs where edges are characterized in multiple ...
متن کاملAdaptive Neighborhood Graph Construction for Inference in Multi-Relational Networks
A neighborhood graph, which represents the instances as vertices and their relations as weighted edges, is the basis of many semi-supervised and relational models for node labeling and link prediction. Most methods employ a sequential process to construct the neighborhood graph. This process often consists of generating a candidate graph, pruning the candidate graph to make a neighborhood graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i5.16515